The Least-Core of Threshold Network Flow Games
نویسنده
چکیده
Network flow games model domains where a commodity can flow through a network controlled by selfish agents. Threshold Network Flow Games (TNFGs) are a form of such games where an agent coalition wins if it manages to send a flow exceeding a certain threshold between a source and a target vertex. Cooperative game theory predicts the agents’ actions in such settings with solutions such as the core, the set of stable distributions of a coalition’s gains among its members. However, some games have empty cores, so every distribution is inherently unstable. When the core is empty, one must use a more relaxed notion of stability, such as the least-core. We examine several problems regarding the least-core in general and restricted TNFGs.
منابع مشابه
Monotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which comprises a variety of games that have enjoyed special attention within AI, in particular, skill games, connectivity games, flow games, voting games, and matching games. Given a threshold, each monotone cooperative gam...
متن کاملThe Cost of Stability in Network Flow Games
The core of a cooperative game contains all stable distributions of a coalition’s gains among its members. However, some games have an empty core, with every distribution being unstable. We allow an external party to offer a supplemental payment to the grand coalition, which may stabilize the game, if the payment is sufficiently high. We consider the cost of stability (CoS)—the minimal payment ...
متن کاملThe Least-Core and Nucleolus of Path Cooperative Games
Cooperative games provide an appropriate framework for fair and stable profit distribution in multiagent systems. In this paper, we study the algorithmic issues on path cooperative games that arise from the situations where some commodity flows through a network. In these games, a coalition of edges or vertices is successful if it enables a path from the source to the sink in the network, and l...
متن کاملLearning Cooperative Games
This paper explores a PAC (probably approximately correct) learning model in cooperative games. Specifically, we are given m random samples of coalitions and their values, taken from some unknown cooperative game; can we predict the values of unseen coalitions? We study the PAC learnability of several well-known classes of cooperative games, such as network flow games, threshold task games, and...
متن کاملIdentifying Flow Units Using an Artificial Neural Network Approach Optimized by the Imperialist Competitive Algorithm
The spatial distribution of petrophysical properties within the reservoirs is one of the most important factors in reservoir characterization. Flow units are the continuous body over a specific reservoir volume within which the geological and petrophysical properties are the same. Accordingly, an accurate prediction of flow units is a major task to achieve a reliable petrophysical description o...
متن کامل